Uniformity for the Decidability of Hybrid Automata

We present some new decidability results on the veri cation of hybrid automata by symbolic analysis (abstract interpretation using polyhedra). The results include de ning a class of hybrid automata for which all properties expressed in the real-time temporal logic Tctl are decidable. The obtained class of automata is shown powerful enough to model reactive applications in which every task eventually terminates within uniformly-bounded time. Indeed, the restrictions we use for obtaining decidability have a physical meaning, and they all impose some kind of uniformity to the runs of hybrid automata.